Petri Net Controlled Grammars with a Bounded Number of Additional Places
نویسندگان
چکیده
A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net, whose places and transitions correspond to the nonterminals and the production rules of the grammar, respectively, and tokens are separate instances of the nonterminals in a sentential form. Therefore, the control of the derivations in a context-free grammar can be implemented by adding some features to the associated cf Petri net. The addition of new places and new arcs from/to these new places to/from transitions of the net leads grammars controlled by k-Petri nets, i.e., Petri nets with additional k places. In the paper we investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars, in particular, we show that these families form an infinite hierarchy with respect to the numbers of additional places.
منابع مشابه
Capacity Bounded Grammars and Petri Nets
The close relationship between Petri nets and language theory has been extensively studied for a long time [1, 2]. Results from the theory of Petri nets have been applied successfully to provide elegant solutions to complicated problems from language theory [4, 7]. A context-free grammar can be associated with a context-free (communica-tion-free) Petri net, whose places and transitions, corresp...
متن کاملParsing Algorithms for Grammars with Regulated Rewriting
In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various regulated grammars such as random context, matrix, vector, valence grammars, etc., resulted from enriching context-free grammars with additional mechanisms can be unified into the Petri net formalism, i.e., a grammar and its control can be represented by a Petri net. Thi...
متن کاملSimplification of a Petri Net controller in industrial systems
This paper deals with the problem of forbidden states in discrete event systems modeled by Petri Net. To avoid the forbidden states, some constraints which are called Generalized Mutual Exclusion Constraints can be assigned to them. Enforcing these constraints on the system can be performed using control places. However, when the number of these constraints is large, a large number of control p...
متن کاملParsing Algorithms for Regulated Grammars
Petri nets, introduced by Carl Adam Petri [12] in 1962, provide a powerful mathematical formalism for describing and analyzing the flow of information and control in concurrent systems. Petri nets can successfully be used as control mechanisms for grammars, i.e., the generative devices of formal languages. In recent papers [4], [5], [9], [16] Petri net controlled grammars have been introduced a...
متن کاملModeling a Bank ATM with Two Directions Places Timed Petri Net (TPN)
A Bank ATM is including controller, card authorization system and a teller unit .This paper explains howthis parts connects together. In this paper will be used of a new mode place in Petri nets. More systemsusually have a complex constructs. ATM will be simulated use of new mode place at this study. The Mainpart of this model is used of T.S.Staines model [1]. We discuss how a simple model of T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta Cybern.
دوره 19 شماره
صفحات -
تاریخ انتشار 2010